New upper bound for the #3-SAT problem
نویسنده
چکیده
We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms. The algorithm achieves a running time of O(1.6423) in the worst case which improves the current best bound of O(1.6737) by Dahllöf et al.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable
The (k, s)-SAT problem is the satisfiability problem restricted to instances where each clause has exactly k literals and every variable occurs at most s times. It is known that there exists a function f such that for s ≤ f(k) all (k, s)-SAT instances are satisfiable, but (k, f(k)+1)-SAT is already NP-complete (k ≥ 3). We prove that f(k) = O(2 · log k/k), improving upon the best know upper boun...
متن کاملUPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM (k, s)-SAT PROBLEM
We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...
متن کاملNon Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
Abstract. We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the num...
متن کاملAnother proof for an upper bound of a local search algorithm for 3 - SAT
We present another proof for an upper bound of a deterministic local search algorithm [3] for 3-SAT. This bound O(1.481n) is currently no longer the best (where n is the number of variables) while the best bound is slightly better: O(1.473n) due to [1].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 105 شماره
صفحات -
تاریخ انتشار 2007